Improvement of Task Scheduling Algorithm for Limited Connected Multiprocessor System
نویسندگان
چکیده
منابع مشابه
Hybrid Algorithm for Multiprocessor Task Scheduling
Multiprocessors have become powerful computing means for running real-time applications and their high performance depends greatly on parallel and distributed network environment system. Consequently, several methods have been developed to optimally tackle the multiprocessor task scheduling problem which is called NPhard problem. To address this issue, this paper presents two approaches, Modifi...
متن کاملA Genetic Algorithm for Multiprocessor Task Scheduling
The goal of task scheduling in a multiprocessor system is to schedule dependent tasks on processors such that the processing time is minimized. This ensures optimal usage of the processing systems. However this problem is NP-hard in nature and heuristic based techniques are used to obtain a good schedule in polynomial time. Genetic Algorithms (GA) have been proposed over other heuristics becaus...
متن کاملImprovement Algorithm for Limited Space Scheduling
Selecting construction methods, scheduling activities, and planning the use of site space are key to constructing a project efficiently. Site layout and activity scheduling have been tackled as independent problems. Their interdependence is often ignored at the planning stage and may be dealt with—if at all—when construction is underway. Problems that may have had easy solutions if dealt with e...
متن کاملA Modified Genetic Algorithm for Task Scheduling in Multiprocessor Systems
The impressive proliferation in the use of multiprocessor systems these days in a great variety of applications is the result of many breakthroughs over the last two decade. In these multiprocessor systems, an efficient scheduling of a parallel program onto the processors that minimizes the entire execution time is vital for achieving a high performance. This problem is exactly known very hard ...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEJ Transactions on Electronics, Information and Systems
سال: 1999
ISSN: 0385-4221,1348-8155
DOI: 10.1541/ieejeiss1987.119.6_676